By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 15, Issue 1, pp. 1-315

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Integration in Finite Terms with Special Functions: The Logarithmic Integral

G. W. Cherry

pp. 1-21

BibTeX  Abstract Full Text:  PDF

An Amortized Analysis of Insertions into AVL-Trees

Kurt Mehlhorn and Athanasios Tsakalidis

pp. 22-33

BibTeX  Abstract Full Text:  PDF

The Signature of a Plane Curve

Joseph O'Rourke

pp. 34-51

BibTeX  Abstract Full Text:  PDF

Self-Adjusting Heaps

Daniel Dominic Sleator and Robert Endre Tarjan

pp. 52-69

BibTeX  Abstract Full Text:  PDF

The Complexity of Languages Generated by Attribute Grammars

Joost Engelfriet

pp. 70-86

BibTeX  Abstract Full Text:  PDF

Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Stephen Cook, Cynthia Dwork, and Rüdiger Reischuk

pp. 87-97

BibTeX  Abstract Full Text:  PDF

The Boyer–Moore–Galil String Searching Strategies Revisited

Alberto Apostolico and Raffaele Giancarlo

pp. 98-105

BibTeX  Abstract Full Text:  PDF

Efficient Simulations among Several Models of Parallel Computers

Friedhelm Meyer auf der Heide

pp. 106-119

BibTeX  Abstract Full Text:  PDF

An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

Zvi Galil, Silvio Micali, and Harold Gabow

pp. 120-130

BibTeX  Abstract Full Text:  PDF

Optimal Termination Protocols for Network Partitioning

Francis Chin and K. V. S. Ramarao

pp. 131-144

BibTeX  Abstract Full Text:  PDF

Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II

M. Shub and S. Smale

pp. 145-161

BibTeX  Abstract Full Text:  PDF

A Provably Good Algorithm for the Two Module Routing Problem

Brenda S. Baker

pp. 162-188

BibTeX  Abstract Full Text:  PDF

Alphabetic Minimax Trees of Degree at Most $t$

D. Coppersmith, M. M. Klawe, and N. J. Pippenger

pp. 189-192

BibTeX  Abstract Full Text:  PDF

On Shortest Paths in Polyhedral Spaces

Micha Sharir and Amir Schorr

pp. 193-215

BibTeX  Abstract Full Text:  PDF

An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network

T. Etzion and A. Lempel

pp. 216-221

BibTeX  Abstract Full Text:  PDF

Variable Sized Bin Packing

D. K. Friesen and M. A. Langston

pp. 222-230

BibTeX  Abstract Full Text:  PDF

Logarithmic Depth Circuits for Algebraic Functions

John H. Reif

pp. 231-242

BibTeX  Abstract Full Text:  PDF

Algebraic Computations of Scaled Padé Fractions

Stanley Cabay and Dong-Koo Choi

pp. 243-270

BibTeX  Abstract Full Text:  PDF

Constructing Belts in Two-Dimensional Arrangements with Applications

H. Edelsbrunner and E. Welzl

pp. 271-284

BibTeX  Abstract Full Text:  PDF

Average Case Complete Problems

Leonid A. Levin

pp. 285-286

BibTeX  Abstract Full Text:  PDF

The Ultimate Planar Convex Hull Algorithm?

David G. Kirkpatrick and Raimund Seidel

pp. 287-299

BibTeX  Abstract Full Text:  PDF

Computing the Largest Empty Rectangle

B. Chazelle, R. L. Drysdale, and D. T. Lee

pp. 300-315

BibTeX  Abstract Full Text:  PDF